Improved deterministic approximation algorithms for Max TSP
نویسندگان
چکیده
منابع مشابه
Improved deterministic approximation algorithms for Max TSP
We present an O(n)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 61 81 , where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n)-time approximation algorithm for the metric case of the problem whose approximation ratio is asymptotically 17 20 . Both algorithms improve ...
متن کاملImproved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is 27 35 . The other is for undirected graphs and its approximation ratio is 78−o(1). Both algorithms improve on the previous bests.
متن کاملDeterministic algorithms for multi-criteria Max-TSP
We present deterministic approximation algorithms for the multi-criteria maximum traveling salesman problem (Max-TSP). Our algorithms are faster and simpler than the existing randomized algorithms. We devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of 1/2k−ε and 1/(4k−2)−ε, respectively, where k is the number of objective functions. For two objectiv...
متن کاملAn Improved Randomized Approximation Algorithm for Max TSP
We present an O(n)-time randomized approximation algorithm for the maximum traveling salesman problem whose expected approximation ratio is asymptotically 251 331 , where n is the number of vertices in the input (undirected) graph. This improves the previous best.
متن کاملImproved Approximation Algorithms for MAX NAE-SAT and MAX SAT
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.8279. This improves a previously conjectured performance guarantee of 0.7977 of Zwick [Zwi99]. Using a variant of our MAX NAE-SAT approximation algorithm, combined with other techniques used in [Asa03], we obtain an app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2005
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2005.03.011